Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
نویسندگان
چکیده
In this paper an algorithm is presented to store and process fully adaptive computational grids requiring only a minimal amount of memory. The adaptive grid is specified by a recursive bisection of triangular grid cells. The cells are stored and processed in an order specified by the Sierpinski space-filling curve. A sophisticated system of stacks is used to ensure cache-efficient access to the unknowns.
منابع مشابه
Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves
We will present an approach to numerical simulation on recursively structured adaptive discretisation grids. The respective grid generation process is based on recursive bisection of triangles along marked edges. The resulting refinement tree is sequentialised according to a Sierpinski space-filling curve, which leads to both minimal memory requirements and inherently cache-efficient processing...
متن کاملEfficient Neighbor-Finding on Space-Filling Curves
Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cache-efficient and parallelization-friendly way for storage in an array. Many algorithms, for example grid-based numerical PDE solvers, have to access all neighbor cells of each grid cell during a grid traversal. While ...
متن کاملInternational Journal for Numerical Methods in Fluids
The weak Lagrange–Galerkin finite element method for the two-dimensional shallow water equations on adaptive unstructured grids is presented. The equations are written in conservation form and the domains are discretized using triangular elements. Lagrangian methods integrate the governing equations along the characteristic curves, thus being well suited for resolving the non-linearities introd...
متن کاملSelf-Avoiding Walks Over Adaptive Triangular Grids
In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a sell avoiding walk which can be applied t...
متن کاملSelf-Avoiding Walks over Adaptive Unstructured Grids
In this paper, we present self-avoiding walks as a novel technique to \linearize" a triangular mesh. Unlike spacelling curves which are based on a geometric embedding, our algorithm is combinatorial since it uses the mesh connectivity only. We also show how the concept can be easily modi ed for adaptive grids that are generated in a hierarchical manner based on a set of simple rules, and made a...
متن کامل